DNA Computing Adopting DNA coding Method to solve Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Heuristic Approaches to Solve Traveling Salesman Problem
This paper provides the survey of the heuristics solution approaches for the traveling salesman problem (TSP). TSP is easy to understand, however, it is very difficult to solve. Due to complexity involved with exact solution approaches it is hard to solve TSP within feasible time. That’s why different heuristics are generally applied to solve TSP. Heuristics to solve TSP are presented here with...
متن کاملITO-based evolutionary algorithm to solve traveling salesman problem
In this paper, a ITO algorithm inspired by ITO stochastic process is proposed for Traveling Salesmen Problems (TSP),so far, many meta-heuristic methods have been successfully applied to TSP, however, as a member of them, ITO needs further demonstration for TSP. So starting from designing the key operators, which include the move operator, wave operator, etc, the method based on ITO for TSP is p...
متن کاملDeveloping Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have proposed several versions of greedy crossover. Here we propose improved version of it. We compare our greedy crossover with some of recent crossovers, we use our gree...
متن کاملA new heuristic procedure to solve the Traveling Salesman problem
This paper presents a heuristic technique that uses the Wang Recurrent Neural Network with the "Winner Takes All" principle to solve the Traveling Salesman Problem. When the Wang Neural Network presents solutions for the Assignment Problem with all constraints satisfied, the "Winner Takes All" principle is applied to the values in the Neural Network’s decision variables, with the additional con...
متن کاملISPO: A New Way to Solve Traveling Salesman Problem
This paper first introduces the concepts of mobile operators and mobile sequence, with which it redefines the rate of particle swarm optimization algorithm and the formula of position updating. Combining this discrete PSO algorithm with neighbors, the paper puts forward Hybrd Particle Swarm Optimization Algorithm, whose effectiveness is verified at the end of this paper.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2004
ISSN: 1976-9172
DOI: 10.5391/jkiis.2004.14.1.105